Securing Harari's Authentication Scheme

Code-based authentication schemes are very fast and efficient for implementation in small devices. The security of these schemes and the size of underlying coding matrices are often the main barriers to their use in practice. In this paper, we remove the security flaw of a classical codebased authentication scheme and modify it to achieve a secure code-based authentication scheme. We provide a formal proof of security for the modified scheme. Moreover, we apply the recent improvement to reduce the size of the coding matrix and to gain an efficient authentication scheme suitable for small devices.